AN EXACT SOLUTION FOR REAL-LIFE TRANSSHIPMENT PATH PROBLEM

In industrial engineering, transportation planning, vehicle routing problem, warehousing, inventory management, and customer service are logistics problems. Graph theory algorithms provide solutions to problems such as the shortest path, minimum spanning tree, a company system with branches transfer centers which affiliated, if sorting process is carried out in centers, deliveries collected from must be transported center. Thus, there situations where delivery transferred sending branch, center, receiving respectively. this flow, transferring single center without visiting two reduces total cost. While moving sender receiver stopping by some on way allows us complete eliminates necessity of leaving these again. number vehicles that need go reduced. The mentioned structure defined graph considered network design problem. Given S, T, set A connected C not S or counting algorithm gives value route among all combinations designed order find optimal source node s ∈ A∪{S}, target t=T. has been implemented Python Gams tested different elements C.